Lecture Beyond Planar Graphs
نویسندگان
چکیده
The main motivation behind this line of work is that some networks are not planar but conform to some generalization of the concept of planarity, like being embeddable on a surface of bounded genus. Furthermore, by Kuratowski’s famous theorem [Kur30], planarity can be characterized be excluding K5 and K3,3 as minors. Hence, it seems natural to study further classes with excluded minors as a generalization of planar graphs.
منابع مشابه
Spectral Graph Theory Lecture 25 Planar Graphs , part 1 Daniel
Planar graphs originated with the studies of polytopes and of maps. The skeleton (edges) of a threedimensional polytope provide a planar graph. We obtain a planar graph from a map by representing countries by vertices, and placing edges between countries that touch each other. Assuming each country is contiguous, this gives a planar graph. While planar graphs were introduced for practical reaso...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملBeyond-Planarity: Density Results for Bipartite Graphs
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations. Early research dates back to the 1960s (e.g., Avital and Hanani [14]) for extremal problems on geometric graphs, but is also related to graph drawing problems ...
متن کاملBeyond-Planar Graphs: Algorithmics and Combinatorics
This report summarizes Dagstuhl Seminar 16452 “Beyond-Planar Graphs: Algorithmics and Combinatorics” and documents the talks and discussions. The seminar brought together 29 researchers in the areas of graph theory, combinatorics, computational geometry, and graph drawing. The common interest was in the exploration of structural properties and the development of algorithms for so-called beyond-...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011